Characterization sets for the nucleolus in balanced games
نویسندگان
چکیده
We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and if the game is monotonic dually saturated coalitions determine both the core and the nucleolus whenever the core is non-empty. We show how these two sets are related to the existing characterization sets. In particular we prove that if the grand coalition is vital then the intersection of essential and dually essential coalitions forms a characterization set itself.
منابع مشابه
On the 1-Nucleolus for Classes of Cooperative Games
This paper analyzes the 1-nucleolus and, in particular, its relation to the nucleolus and compromise value. It is seen that the 1-nucleolus of a cooperative game can be characterized using a combination of standard bankruptcy rules for associated bankruptcy problems. In particular, for any zero-normalized balanced game, the 1-nucleolus coincides with the Aumann-Maschler rule (Aumann and Maschle...
متن کاملStrongly essential coalitions and the nucleolus of peer group games
Most of the known e cient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class belong to a prespeci ed collection of size polynomial in the number of players. We consider a subclass...
متن کاملThe Integer Nucleolus of Directed Simple Games: A Characterization and an Algorithm
We study the class of directed simple games, assuming that only integer solutions are admitted; i.e., the players share a resource that comes in discrete units. We show that the integer nucleolus—if nonempty—of such a game is composed of the images of a particular payoff vector under all symmetries of the game. This payoff vector belongs to the set of integer imputations that weakly preserve th...
متن کاملNoncooperative foundations of the nucleolus in majority games
This paper studies coalition formation, payoff division and expected payoffs in a ”divide the dollar by majority rule” game with random proposers. A power index is called self-confirming if it can be obtained as an equilibrium of the game using the index itself as probability vector. Unlike the Shapley value and other commonly used power indices, the nucleolus has this property. The proof uses ...
متن کاملMatching Games: The Least Core and the Nucleolus
A matching game is a cooperative game defined by a graph G = .V; E/. The player set is V and the value of a coalition S ⊆ V is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an alternative characterization of the least core which may be of independent interest. The general case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 44 شماره
صفحات -
تاریخ انتشار 2016